Distributed link scheduling with constant overhead

Consistent Distributed Commit: A Constant Overhead Solution

Indistinguishability Obfuscation with Constant Size Overhead

Present constructions of indistinguishability obfuscation (iO) create obfuscated programs where the size of the obfuscated program is at least a factor of a security parameter larger than the size of the original program. In this work, we construct the first iO scheme that achieves only a constant multiplicative overhead (in fact, the constant is 2) in the size of the program. The security of o...

Secure Arithmetic Computation with Constant Computational Overhead

We study the complexity of securely evaluating an arithmetic circuit over a finite field F in the setting of secure two-party computation with semi-honest adversaries. In all existing protocols, the number of arithmetic operations per multiplication gate grows either linearly with log |F| or polylogarithmically with the security parameter. We present the first protocol that only makes a constan...

Fault-tolerant quantum computation with constant overhead

What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to tha...

Improved Parallel Job Scheduling with Overhead

We consider a parallel job scheduling model that incorporates both computation time and communication overhead. For any job J j with length p j, if k j processors are assigned to execute the job, then the actual execution time of the job is t j = p j=k j +(k j 1)c, where c is a constant overhead cost associated with each processor except the master processor that initiates the parallel computat...